Some constructions for 1-rotational BIBD's with block size 5
نویسنده
چکیده
A bstract. We give miscellaneous constructions for I-rotational (4q+l,5,?\)-BIBD's, being q an odd prime power, investigating their possible resolvability whenever q (mod 10). Concerning Steiner 2-designs, the strongest result that we obtain, is the explicit construction of a I-rotational (4q+l,5,1)-BIBD (with a multiplier of order 5) for each prime q == 1 (mod 30) such that (11 + 5-[5) /2 is not a cube (mod q). As a particular consequence of our constructions, we get new (125,5,1) and new (156,6,1) BIBD's. The only ones with these parameters previously known were those obtainable from the 3-dimensional affine and projective geometries over Z 5'
منابع مشابه
Concerning cyclic group divisible designs with block size three
We determine a necessary and sufficient condition for the existence of a cyclic {3}-GDD with a uniform group size 6n. This provides a fundamental class of ingredients for some recursive constructions which settle existence of k-rotational Steiner triple systems completely.
متن کاملPairwise additive 1-rotational BIB designs with λ=1
The existence of pairwise additive balanced incomplete block (BIB) designs and pairwise additive cyclic BIB designs with λ = 1 has been discussed through direct and recursive constructions in the literature. This paper takes BIB designs with 1-rotational automorphisms and then the existence of pairwise additive 1-rotational BIB designs is investigated for λ = 1. Finally, it is shown that there ...
متن کاملConstructions of Balanced Sampling Plan excluding Contiguous Units
Balanced sampling plan excluding contiguous units (or BSEC for short) was rst introduced by Hedayat, Rao and Stufken in 1988. These designs can be used for survey sampling when the units are arranged in one-dimensional ordering and the contiguous units in this ordering provide similar information. The properties and constructions of these objects were discussed in several papers, however, the e...
متن کاملConstruction of secure and fast hash functions using nonbinary error-correcting codes
This paper considers iterated hash functions. It proposes new constructions of fast and secure compression functions with -bit outputs for integers 1 based on error-correcting codes and secure compression functions with -bit outputs. This leads to simple and practical hash function constructions based on block ciphers such as Data Encryption Standard (DES), where the key size is slightly smalle...
متن کاملGroup Divisible Designs With Two Groups and Block Size Five With Fixed Block Configuration
We present constructions and results about GDDs with two groups and block size five in which each block has Configuration (s, t), that is, in which each block has exactly s points from one of the two groups and t points from the other. After some results for a general k, s and t, we consider the (2, 3) case for block size 5. We give new necessary conditions for this family of GDDs and give mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 17 شماره
صفحات -
تاریخ انتشار 1998